Enumeration of Valid Partial Configurations
نویسندگان
چکیده
Models of configurable products can have hundreds of variables and thousands of configuration constraints. A product engineer usually has a limited responsibility area, and thus is interested in only a small subset of the variables that are relevant to the responsibility area. It is important for the engineer to have an overview of possible products with respect to the responsibility area, with all irrelevant information omitted. Configurations with some variables omitted we will call partial configurations, and we will call a partial configuration valid if it can be extended to a complete configuration satisfying all configuration constraints. In this paper we consider exact ways to compute valid partial configurations: we present two new algorithms based on Boolean satisfiability solvers, as well as ways to use knowledge compilation methods (Binary Decision Diagrams and Decomposable Negation Normal Form) to compute valid partial configurations. We also show that the proposed methods are feasible on configuration data from two automotive companies.
منابع مشابه
A Symbolic Partial Order Reduction Algorithm for Rule Based Transition Systems
Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial order algorithms assume that the concurrency model is based on processes. Rule based formalisms, such a...
متن کاملEnumeration of the non-isomorphic configurations for a reconfigurable modular robot with square-cubic-cell modules
Configuration of a reconfigurable modular system is a tough issue because the possible configurations or structures grow exponentially with the number of modules. A library of the non‐isomorphic configurations should be set up as a database for configuration design and control. In this paper, we propose a matrix‐based enumerating approach for the non‐isomorphic configurati...
متن کاملParallelizing frequent web access pattern mining with partial enumeration for high speedup
The maximum speedup of direct parallelization of pattern-growth mining algorithms for long sequences is limited by the load imbalance among the parallel tasks. In this paper, we present a scheme to parallelize pattern-growth mining algorithms using partial enumeration for high speedup. The experimental results show that partial enumeration increases the achievable speedup of parallel mining sig...
متن کاملA note on initial Segments of the Enumeration Degrees
We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below every nonzero enumeration degree one can embed every countable partial order. The result can be relativized above any total degree: If a,b are enumeration degrees, with a total, and a < b, then in the degree interval (a,b), one can embed every countable partial order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011